Bridging Bernstein and Lagrange polynomials
نویسندگان
چکیده
Linear combinations of iterates of Bernstein polynomials exponentially converging to the Lagrange interpolating polynomial are given. The results are applied in CAGD to get an exponentially fast weighted progressive iterative approximation technique to fit data with finer and finer precision. AMS subject classifications: 41A25, 41A36
منابع مشابه
Bernstein-Polynomials-Based Highly Accurate Methods for One-Dimensional Interface Problems
A new numerical method based on Bernstein polynomials expansion is proposed for solving onedimensional elliptic interface problems. Both Galerkin formulation and collocation formulation are constructed to determine the expansion coefficients. In Galerkin formulation, the flux jump condition can be imposed by the weak formulation naturally. In collocation formulation, the results obtained by B-p...
متن کاملBernstein Bases are Optimal , but , sometimes , Lagrange Bases are Better
Experimental observations of rootfinding by generalized companion matrix pencils expressed in the Lagrange basis show that the method can sometimes be numerically stable, and indeed sometimes be much more stable than rootfinding of polynomials expressed in even the Bernstein basis. This paper details some of those experiments and provides a theoretical justification for this. We prove that a ne...
متن کاملOn a generalization of Bernstein polynomials and Bézier curves based on umbral calculus
In [20] a generalization of Bernstein polynomials and Bézier curves based on umbral calculus has been introduced. In the present paper we describe new geometric and algorithmic properties of this generalization including: (1) families of polynomials introduced by Stancu [19] and Goldman [12], i.e., families that include both Bernstein and Lagrange polynomial, are generalized in a new way, (2) a...
متن کاملNumerical solution of delay differential equations via operational matrices of hybrid of block-pulse functions and Bernstein polynomials
In this paper, we introduce hybrid of block-pulse functions and Bernstein polynomials and derive operational matrices of integration, dual, differentiation, product and delay of these hybrid functions by a general procedure that can be used for other polynomials or orthogonal functions. Then, we utilize them to solve delay differential equations and time-delay system. The method is based upon e...
متن کاملThe Numerical Solution of Some Optimal Control Systems with Constant and Pantograph Delays via Bernstein Polynomials
In this paper, we present a numerical method based on Bernstein polynomials to solve optimal control systems with constant and pantograph delays. Constant or pantograph delays may appear in state-control or both. We derive delay operational matrix and pantograph operational matrix for Bernstein polynomials then, these are utilized to reduce the solution of optimal control with constant...
متن کامل